Algebra and Coalgebra on Posets
نویسندگان
چکیده
A lot of combinatorial objects have algebra and coalgebra structures posets are important objects. In this paper, we construct on the vector space spanned by posets. Firstly, associativity unitary property, prove that with conjunction product is a graded algebra. Then definition free algebra, free. Finally, coassociativity counitary unshuffle coproduct coalgebra.
منابع مشابه
Coalgebra-to-Algebra Morphisms
Given a coalgebra p for HG, an algebra s for GH and the obvious notion of morphism from coalgebra to algebra, we observe that morphisms from Gp to s correspond to morphisms from p to Hs in the manner of an adjunction even when there is no adjunction between G and H. This appears to be one of the basic phenomena underlying the transport of special algebras. A proof of Freyd’s Iterated Square The...
متن کاملInitial Algebra and Final Coalgebra Semantics
The aim of this paper is to relate initial algebra semantics and final coalgebra semantics. It is shown how these two approaches to the semantics of programming languages are each others dual, and some conditions are given under which they coincide. More precisely, it is shown how to derive initial semantics from final semantics, using the initiality and finality to ensure their equality. Moreo...
متن کاملUniversal Dialgebra: Unifying Universal Algebra and Coalgebra
The concept of dialgebra provides a platform under which universal algebra and coalgebra are unified in one theory. Other examples of dialgebras include universal multialgebras and partial algebras. In the dialgebraic setting, several relationships between common features of these various theories are clarified and, in many cases, rather similar proofs of closely related results are combined to...
متن کاملScientific Modelling with Coalgebra-Algebra Homomorphisms
Many recursive functions can be defined elegantly as the unique homomorphisms, between two algebras, two coalgebras, or one each, that are induced by some universal property of a distinguished structure. Besides the well-known applications in recursive functional programming, several basic modes of reasoning about scientific models have been demonstrated to admit such an exact meta-theory. Here...
متن کاملEL-labelings, supersolvability and 0-Hecke algebra actions on posets
It is well known that if a finite graded lattice of rank n is supersolvable, then it has an EL-labeling where the labels along any maximal chain form a permutation. We call such a labeling an Sn EL-labeling and we show that a finite graded lattice of rank n is supersolvable if and only if it has such a labeling. We next consider finite graded posets of rank n with 0̂ and 1̂ that have an Sn EL-lab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open Journal of Applied Sciences
سال: 2022
ISSN: ['2165-3917', '2165-3925']
DOI: https://doi.org/10.4236/ojapps.2022.127083